- fixed point combinator
- комбинатор для нахождения неподвижных точек (функции)
English-Russian electronics dictionary .
fixed point combinator
Смотреть что такое "fixed point combinator" в других словарях:
Fixed-point combinator — Y combinator redirects here. For the technology venture capital firm, see Y Combinator (company). In computer science, a fixed point combinator (or fixpoint combinator[1] ) is a higher order function that computes a fixed point of other functions … Wikipedia
Fixed point combinator — A fixed point combinator (or fixed point operator) is a higher order function that computes a fixed point of other functions. This operation is relevant in programming language theory because it allows the implementation of recursion in the form… … Wikipedia
Fixed point — has many meanings in science, most of them mathematical. *Fixed point (mathematics) *Fixed point combinator *Fixed point arithmetic, a manner of doing arithmetic on computers *For “fixed points” in physics, see Renormalization group *Fixed points … Wikipedia
Fixed point theorem — In mathematics, a fixed point theorem is a result saying that a function F will have at least one fixed point (a point x for which F ( x ) = x ), under some conditions on F that can be stated in general terms. Results of this kind are amongst the … Wikipedia
Fixed point (mathematics) — Not to be confused with a stationary point where f (x) = 0. A function with three fixed points In mathematics, a fixed point (sometimes shortened to fixpoint, also known as an invariant point) of a function is a point[1] that is … Wikipedia
SKI combinator calculus — is a computational system that is a reduced, untyped version of Lambda calculus. All operations in Lambda calculus are expressed in SKI as binary trees whose leaves are one of the three symbols S, K, and I (called combinators). In fact, the… … Wikipedia
Combinatory logic — Not to be confused with combinational logic, a topic in digital electronics. Combinatory logic is a notation introduced by Moses Schönfinkel and Haskell Curry to eliminate the need for variables in mathematical logic. It has more recently been… … Wikipedia
List of mathematics articles (F) — NOTOC F F₄ F algebra F coalgebra F distribution F divergence Fσ set F space F test F theory F. and M. Riesz theorem F1 Score Faà di Bruno s formula Face (geometry) Face configuration Face diagonal Facet (mathematics) Facetting… … Wikipedia
Kleene's recursion theorem — In computability theory, Kleene s recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions. The theorems were first proved by Stephen Kleene in 1938.This article uses the… … Wikipedia
Simply typed lambda calculus — The simply typed lambda calculus (lambda^ o) is a typed interpretation of the lambda calculus with only one type combinator: o (function type). It is the canonical and simplest example of a typed lambda calculus. The simply typed lambda calculus… … Wikipedia
Anonymous recursion — In computer science, anonymous recursion is a recursion technique that uses anonymous functions. Construction Suppose that f is an n argument recursive function defined in terms of itself:: f(x 1, x 2, dots, x n) := mbox{expression in terms of }… … Wikipedia
